Core Stability of Dominating Set Games
نویسندگان
چکیده
In this paper, we study the core stability of the dominating set game which has arisen from the cost allocation problem related to domination problem on graphs. Let G be a graph whose neighborhood matrix is balanced. Applying duality theory of linear programming and graph theory, we prove that the dominating set game corresponding to G has the stable core if and only if every vertex belongs to a maximum 2packing in G. We also show that for dominating set games corresponding to G, the core is stable if it is large, the game is extendable, or the game is exact. In fact, the core being large, the game being extendable and the game being exact are shown to be equivalent.
منابع مشابه
On connected dominating set games †
Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition,...
متن کاملOn the vertices of the k-additive core
The core of a game v on N , which is the set of additive games φ dominating v such that φ(N) = v(N), is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular functions, matroids and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define the k-additive core by replacing a...
متن کاملOn the vertices of the k-addiive core
The core of a game v on N , which is the set of additive games φ dominating v such that φ(N) = v(N), is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular functions, matroids and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define the k-additive core by replacing a...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملThe core of bicapacities and bipolar games
Bicooperative games generalize classical cooperative games in the sense that a player is allowed to play in favor or against some aim, besides non participation. Bicapacities are monotonic bicooperative games, they are useful in decision making where underlying scales are of bipolar nature, i.e., they distinguish between good/satisfactory values and bad/unsatisfactory ones. We propose here a mo...
متن کامل